On the iteration of certain quadratic maps over GF(p)
نویسندگان
چکیده
We consider the properties of certain graphs based on iteration of the quadratic maps x→ x2 and x → x2 − 2 over a finite field GF (p).
منابع مشابه
Note on Design Criteria for Rainbow-Type Multivariates
Problem MQ: Solve the system p1 = p2 = · · · = pm = 0, where each pi is a quadratic polynomial in x = (x1, . . . , xn) and coefficients and variables are in K = GF(q). Generic MQ is NP-hard [GJ79], and consensus pegs it as a difficult problem to solve even probabilistically. The trapdoor is built into the public map P by the knowledge of the maps S and T . The central map Q may contain paramete...
متن کاملOn The Convergence Of Modified Noor Iteration For Nearly Lipschitzian Maps In Real Banach Spaces
In this paper, we obtained the convergence of modified Noor iterative scheme for nearly Lipschitzian maps in real Banach spaces. Our results contribute to the literature in this area of re- search.
متن کاملA New Characterization of Semi-bent and Bent Functions on Finite Fields*
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF (2)-linear combination of Gold functions Tr(x i+1) is semi-bent over GF (2), n odd, by a polynomial GCD computation. By analyzing this GCD condition, we provide simpler characterizations of semi-bent functions. For example, we deduce that all linear combinations of Gold fu...
متن کاملQuadratic Polynomials with Julia Sets of Hausdorr Dimension Close to 2
We consider certain families of quadratic polynomials which admit pa-rameterisations in a neighbourhood of the boundary of the Mandelbrot set. We show that the associated Julia sets are of Hausdorr dimension arbitrarily close to 2. Our construction clariies related work by Shishikura. 0 Introduction During the last decade much attention has been paid to the fractal aspects of degeneration proce...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 277 شماره
صفحات -
تاریخ انتشار 2004